Conway games, algebraically and coalgebraically

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conway games, algebraically and coalgebraically

Using coalgebraic methods, we extend Conway’s theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we focus on non-losing strategies. Hypergames are a fruitful metaphor for non-terminating processes, Conway’s sum being similar to shuffling. We dev...

متن کامل

Conway Games, Coalgebraically

Using coalgebraic methods, we extend Conway’s original theory of games to include infinite games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we focus on non-losing strategies. Infinite games are a fruitful metaphor for non-terminating processes, Conway’s sum of games being similar to shuffling. Hypergames hav...

متن کامل

The Conway Polynomial of an Algebraically Split Link

Morton made an insightful conjecture concerning the rst non-trivial coeecient of the Alexander-Conway polynomial r L (z) of an algebraically split link L, i.e. any pair of components has linking number 0. If r L (z) = P a i z i , then Morton conjectured that a i = 0 if i 2m ? 3 and a 2m?2 depends only on the triple Milnor-invariants ijk (L), where m is the number of components in L. In fact a p...

متن کامل

Equivalences and Congruences on Infinite Conway Games

The increasing use of games as a convenient metaphor for modeling interactions has spurred the growth of a broad variety of game definitions in Computer Science. Furthermore, in the presentation of games many related concepts are None has a unique definition. Some, but not always the same, are taken as primitive while the others are reduced to them. And many more properties need to be specified...

متن کامل

An Introduction to Conway ’ S Games

Combinatorial Game Theory is a fascinating and rich theory, based on a simple and intuitive recursive definition of games, which yields a very rich algebraic structure: games can be added and subtracted in a very natural way, forming an abelian GROUP (§ 2). There is a distinguished subGROUP of games called numbers which can also be multiplied and which form a FIELD (§ 3): this field contains bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2011

ISSN: 1860-5974

DOI: 10.2168/lmcs-7(3:8)2011